On computing accurate singular values and eigenvalues . . .
نویسنده
چکیده
[15] D. O'Leary and G. W. Stewart. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. [17] A. Sameh and D. Kuck. A parallel QR algorithm for symmetric tridiagonal matrices. [21] Zhonggang Zeng. The acyclic eigenproblem can be reduced to the arrowhead one. [22] Hongyuan Zha. A two-way chasing scheme for reducing a symmetric arrowhead matrix to tridiagonal form. Scientic computing and computational mathematics, Stanford University, 1992. 12 Acknowledgement
منابع مشابه
Accurate computation of singular values and eigenvalues of symmetric matrices ∗
We give the review of recent results in relative perturbation theory for eigenvalue and singular value problems and highly accurate algorithms which compute eigenvalues and singular values to the highest possible relative accuracy.
متن کاملOn Computing Accurate Singular Values and Eigenvalues of Matrices with Acyclic Graphs
[15] D. O'Leary and G. W. Stewart. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. [17] A. Sameh and D. Kuck. A parallel QR algorithm for symmetric tridiagonal matrices. [21] Zhonggang Zeng. The acyclic eigenproblem can be reduced to the arrowhead one. [22] Hongyuan Zha. A two-way chasing scheme for reducing a symmetric arrowhead matrix to tridiagonal form. Scientic ...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملEnhancing Multicore System Performance Using Parallel Computing with MATLAB
A Typical Numerical Computing Problem To illustrate the two paradigms, we will use MATLAB to test a hypothesis regarding Girko’s circular law. Girko’s law states that the eigenvalues of a random N-by-N matrix whose elements are drawn from a normal distribution tend to lie inside a circle of radius sqrt(N) for large enough N. Our hypothesis is that Girko’s circular law can be modified to apply t...
متن کاملRelative Perturbation Theory: I. Eigenvalue and Singular Value Variations∗
The classical perturbation theory for Hermitian matrix eigenvalue and singular value problems provides bounds on the absolute differences between approximate eigenvalues (singular values) and the true eigenvalues (singular values) of a matrix. These bounds may be bad news for small eigenvalues (singular values), which thereby suffer worse relative uncertainty than large ones. However, there are...
متن کامل